منابع مشابه
Linear-Time Computation of Local Periods
We present a linear-time algorithm for computing all local periods of a given word. This subsumes (but is substantially more powerful than) the computation of the (global) period of the word and on the other hand, the computation of a critical factorization, implied by the Critical Factorization Theorem.
متن کاملQuasi-linear Time Computation of the Abelian Periods of a Word
In the last couple of years many research papers have been devoted to Abelian complexity of words. Recently, Constantinescu and Ilie (Bulletin EATCS 89, 167–170, 2006) introduced the notion of Abelian period. In this article we present two quadratic brute force algorithms for computing Abelian periods for special cases and a quasi-linear algorithm for computing all the Abelian periods of a word.
متن کاملLocal Computation Aspects of Bayes Linear Kinematics
Goldstein and Shaw (2002) developed Bayes linear kinematics describing how a Bayes linear analysis should be carried out when we only receive partial information which changes our beliefs about a vector of random quantities in some generalised way. In this paper we explore principles of local computation for Bayes linear kinematic updates. This theory is illustrated by the Bayes linear Bayes mo...
متن کاملLimel: Local Computation with Linear Coordination
Limel is a new systems programming language for constructing efficient, scalable data processing pipelines. Code is written in the style of ML, and the compiler statically specialises the output for execution on either multi-core systems (with call-by-reference semantics) or distributed clusters (with call-by-value semantics), or a combination of both. No modification to the source code is requ...
متن کاملLinear Time Computation of QFT Feasible Regions
This paper represents ongoing research to reduce the computational cost of implementations of quantitative feedback theory (QFT), using ideas from Kharitonov stability theory and the theory of algorithms. By limiting our analysis to the simple case of a plant transfer function with denominator uncertainty, we gain insight into the problem of determining tracking, robust stability and actuator b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.06.024